Computationally Efficient Algorithm for Eco-Driving Over Long Look-Ahead Horizons
نویسندگان
چکیده
This paper presents a computationally efficient algorithm for eco-driving along horizons of over 100 km. The problem is formulated as bi-level program, where the bottom level solved offline, pre-optimising gear function longitudinal velocity (kinetic energy) and acceleration. top online, optimising nonlinear dynamic program with travel time, kinetic energy acceleration state variables. To further reduce computational effort, time adjoined to objective by applying necessary Pontryagin’s Maximum Principle conditions, using real-time iteration sequential quadratic programming scheme in model predictive control framework. Compared average driver’s driving cycle, savings proposed up 11.60%.
منابع مشابه
A look-ahead Schur Algorithm
The classical Schur algorithm computes the LDL T factorization of a symmetric Toeplitz matrix in O(n 2) operations, but requires that all the principal minors of the matrix be nonsingular. Look-ahead schemes have been proposed to deal with matrices that have exactly singular principal minors 9], 11]. Unfortunately, these algorithms cannot be extended to matrices that have ill-conditioned princi...
متن کاملA Block Toeplitz Look-ahead Schur Algorithm
This paper gives a look-ahead Schur algorithm for nding the symmetric factorization of a Hermitian block Toeplitz matrix. The method is based on matrix operations and does not require any relations with orthogonal polynomials. The simplicity of the matrix based approach ought to shed new light on other issues such as parallelism and numerical stability.
متن کاملDesign of an efficient algorithm for fuel-optimal look-ahead control
A fuel-optimal control algorithm is developed for a heavy diesel truck that utilizes information about the road topography ahead of the vehicle when the route is known. A prediction model is formulated where special attention is given to properly include gear shiing. e aim is an algorithm with suciently low computational complexity. To this end, a dynamic programming algorithm is tailored, an...
متن کاملLAFI: Look-Ahead Mechanism for Energy-Efficient Branch Prediction
To feed the execution core with uninterrupted instruction streams, modern processors access complex branch predictors every clock cycle, incurring high energy consumption. In this paper, we conduct a systematic study on the energy consumption of representative branch predictors, and identify several sources of energy inefficiency. Based on this study, we introduce an improved branch predictor d...
متن کاملAcoustic Look-Ahead for More Efficient Decoding in LVCSR
In this paper we propose novel approximations of a generalized acoustic look-ahead to speed up the search process in large vocabulary continuous speech recognition (LVCSR). Unlike earlier methods, we do not employ any phonemeor syllable level heuristics. First we define and analyze the perfect acoustic look-ahead as a simple pre-evaluation of the original acoustic models into the future. This m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Intelligent Transportation Systems
سال: 2022
ISSN: ['1558-0016', '1524-9050']
DOI: https://doi.org/10.1109/tits.2021.3058418